PERT-V A Two-Dimensional Perturbation Code for Fast Reactor Analysis
نویسندگان
چکیده
منابع مشابه
Two-dimensional Totalistic Code 52
The totalistic two-dimensional cellular automaton code 52 is capable of a wide variety of behavior. In this paper we look at its generic behavior, its complex behavior on simple backgrounds, its versatility in performing finite computations, and its block emulations of elementary cellular automata (ECA). In all, we found 65 ECA which are emulated by code 52. Taken together, the evidence is stro...
متن کاملAnalytical Solution for Two-Dimensional Coupled Thermoelastodynamics in a Cylinder
An infinitely long hollow cylinder containing isotropic linear elastic material is considered under the effect of arbitrary boundary stress and thermal condition. The two-dimensional coupled thermoelastodynamic PDEs are specified based on equations of motion and energy equation, which are uncoupled using Nowacki potential functions. The Laplace integral transform and Bessel-Fourier series are u...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملTokamak Reactor System Analysis Code for the Conceptual Development of Demo Reactor
The development strategy of nuclear fusion energy in the Korea National Basic Plan for the Development of Fusion Energy consists of several major programs. These are shown in Fig. 1, and include KSTAR for the study of a long-pulse, advanced tokamak operation, ITER for a burning plasma experiment, the DEMO reactor for the demonstration of producing net electricity from a fusion reactor, and a co...
متن کاملA Fast Two-Dimensional Median Filtering Algorithm
Aktmcz-We present a fast algorithm for two-dimensional median fiitering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m X n, the computer time required is O(n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Science and Engineering
سال: 1969
ISSN: 0029-5639,1943-748X
DOI: 10.13182/nse69-a21163